On the communication complexity of XOR functions
نویسندگان
چکیده
An XOR function is a function of the form g(x, y) = f(x ⊕ y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f . We also show that, when f is monotone, g’s quantum and classical complexities are quadratically related, and that when f is a linear threshold function, g’s quantum complexity is Θ(n). More generally, we make a structural conjecture about the Fourier spectra of boolean functions which, if true, would imply that the quantum and classical exact communication complexities of all XOR functions are asymptotically equivalent. We give two randomised classical protocols for general XOR functions which are efficient for certain functions, and a third protocol for linear threshold functions with high margin. These protocols operate in the symmetric message passing model with shared randomness.
منابع مشابه
The Unbounded-Error Communication Complexity of symmetric XOR functions
Settling a conjecture of Shi and Zhang [ZS09], we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov.
متن کاملThe Log-Rank Conjecture for Read- k XOR Functions
The log-rank conjecture states that the deterministic communication complexity of a Boolean function g (denoted by D(g)) is polynomially related to the logarithm of the rank of the communication matrixMg whereMg is the communication matrix defined byMg(x, y) = g(x, y). An XOR function F : {0, 1} × {0, 1} → {0, 1} with respect to f : {0, 1} → {0, 1} is a function defined by F (x, y) = f(x⊕ y). I...
متن کاملQuantum and randomized communication complexity of XOR functions in the SMP model
Communication complexity of XOR functions f(x ⊕ y) has attracted increasing attention in recent years, because of its connections to Fourier analysis, and its exhibition of exponential separations between classical and quantum communication complexities of total functions. However, the complexity of certain basic functions still seems elusive especially in the privatecoin SMP model. In particul...
متن کاملCommunication Complexities of XOR functions
We call F : {0, 1}n×{0, 1}n → {0, 1} a symmetric XOR function if for a function S : {0, 1, ..., n} → {0, 1}, F (x, y) = S(|x⊕ y|), for any x, y ∈ {0, 1}n, where |x⊕ y| is the Hamming weight of the bit-wise XOR of x and y. We show that for any such function, (a) the deterministic communication complexity is always Θ(n) except for four simple functions that have a constant complexity, and (b) up ...
متن کاملCommunication complexities of symmetric XOR functions
We call F : {0, 1}n×{0, 1}n → {0, 1} a symmetric XOR function if for a function S : {0, 1, ..., n} → {0, 1}, F (x, y) = S(|x⊕ y|), for any x, y ∈ {0, 1}n, where |x⊕ y| is the Hamming weight of the bit-wise XOR of x and y. We show that for any such function, (a) the deterministic communication complexity is always Θ(n) except for four simple functions that have a constant complexity, and (b) up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0909.3392 شماره
صفحات -
تاریخ انتشار 2009